Sturmian Morphisms, the Braid Group B 4 , Christoffel Words and Bases of F 2
نویسنده
چکیده
We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F2) of automorphisms of the rank two free group F2 and show that it can be realized as a monoid in the group B4 of braids on four strings. In the second part we use Christoffel words to construct an explicit basis of F2 lifting any given basis of the free abelian group Z . We further give an algorithm allowing to decide whether two elements of F2 form a basis or not. We also show that, under suitable conditions, a basis has a unique conjugate consisting of two palindromes. Mathematics Subject Classification (2000). 05E99, 20E05, 20F28, 20F36, 20M05, 37B10, 68R15
منابع مشابه
On Christoffel and standard words and their derivatives
We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the aforementioned classes of words. In the case of Christoffel words, the morphisms involved map a to ak+1b (resp., abk) and b to akb (resp., abk+1) for a suitable k > 0. As...
متن کاملOn a generalization of Christoffel words: epichristoffel words
Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been extensively studied since the 18th century. One of the generalization of these sequences are the episturmian sequences, introduced by A. de Luca [dL97a] and studi...
متن کاملOn an involution of Christoffel words and Sturmian morphisms
There is a natural involution on Christoffel words, originally studied by the second author in [dL2]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (on...
متن کاملA Characterization of Sturmian Morphisms
A one-sided infinite word is balanced if the difference of the number of occurrences of a letter in two factors of the same length never exceeds one. It is Sturmian if it is balanced and not ultimately periodic. Sturmian words have a long history. A clear exposition of early work by J. Bernoulli, Christoffel, and A. A. Markov is given in the book by Venkov [22]. The term "Sturmian" has been use...
متن کاملA Characterization of Bispecial Sturmian Words
A finite Sturmian word w over the alphabet {a, b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005